Lossy Joint Source-Channel Coding for Energy Harvesting Communication Systems

نویسنده

  • Meysam Shahrbaf Motlagh
چکیده

In this work, we study the problem of lossy joint source-channel coding in an energy harvesting single-user communication system with causal energy arrivals, where the energy storage unit may have leakage. In particular, we investigate the achievable distortion in the transmission of a single source with arbitrary alphabets via an energy harvesting transmitter over a point-to-point channel. We first establish a lower bound on the achievable distortion. Then, to minimize the distortion we consider an adaptive joint source-channel coding scheme, where the length of channel codewords varies adaptively based on the available battery charge in each communication block. For this scheme, we obtain two coupled equations that determine the mismatch ratio between channel symbols and input symbols as well as the transmission power, both as functions of battery charge. As examples of continuous and discrete sources, we consider Gaussian and binary sources. In particular, for the Gaussian case, we obtain a closed form expression for the mismatch factor in terms of the LambertW function, and show that an increasing transmission power results in a decreasing mismatch factor and vice versa. We also numerically show that when the mismatch factor adaptively changes based on the available charge in the battery, the communication system achieves a smaller distortion compared to that of a constant mismatch factor.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Lossy data compression: nonasymptotic fundamental limits

The basic tradeoff in lossy compression is that between the compression ratio (rate) and the fidelity of reproduction of the object that is compressed. Traditional (asymptotic) information theory seeks to describe the optimum tradeoff between rate and fidelity achievable in the limit of infinite length of the source block to be compressed. A perennial question in information theory is how relev...

متن کامل

On the Joint Source-Channel Coding Error Exponent for Discrete Memoryless Systems: Computation and Comparison with Separate Coding

We investigate the computation of Csiszár’s bounds for the joint source-channel coding (JSCC) error exponent, EJ , of a communication system consisting of a discrete memoryless source and a discrete memoryless channel. We provide equivalent expressions for these bounds and derive explicit formulas for the rates where the bounds are attained. These equivalent representations can be readily compu...

متن کامل

A joint source and channel coding algorithm for error-resilient SPIHT-coded video bitstreams

We propose an analytical rate-distortion optimized joint source and channel coding algorithm for error-resilient scalable encoded video for lossy transmission. A video is encoded into multiple independent substreams to avoid error propagation and is assigned forward error correction (FEC) codes and source bits using Lagrange optimization. Our method separates video coding and packetization into...

متن کامل

Joint Source-Channel Turbo Techniques for Discrete-Valued Sources: From Theory to Practice

The principles which have been prevailing so far for designing communication systems rely on Shannon’s source and channel coding separation theorem [1]. This theorem states that source and channel optimum performance bounds can be approached as close as desired by designing independently the source and channel coding strategies. However, this theorem holds only under asymptotic conditions, wher...

متن کامل

An efficient secure channel coding scheme based on polar codes

In this paper, we propose a new framework for joint encryption encoding scheme based on polar codes, namely efficient and secure joint secret key encryption channel coding scheme. The issue of using new coding structure, i.e. polar codes in Rao-Nam (RN) like schemes is addressed. Cryptanalysis methods show that the proposed scheme has an acceptable level of security with a relatively smaller ke...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2014